Defining Operational Logics
نویسندگان
چکیده
Much analysis of games focuses, understandably, on their mechanics and the resulting audience experiences. Similarly, many genres of games are understood at the level of mechanics. But there is also the persistent sense that a deeper level of analysis would be useful, and a number of proposals have been made that attempt to look toward a level that undergirds mechanics. This paper focuses on a particular approach of this sort—operational logics—first proposed by Noah Wardrip-Fruin (2005) and since then discussed by authors such as Michael Mateas (2006) and Ian Bogost (2007). Operational logics connect fundamental abstract operations, which determine the state evolution of a system, with how they are understood at a human level. In this paper we expand on the concept of operational logics, offering a more detailed and rigorous discussion than provided in earlier accounts, setting the stage for more effective future use of logics as an analytical tool. In particular, we clarify that an operational logic defines an authoring (representational) strategy, supported by abstract processes or lower-level logics, for specifying the behaviors a system must exhibit in order to be understood as representing a specified domain to a specified audience. We provide detailed discussion of graphical and resource management logics, as well as explaining problems with certain earlier expansions of the term (e.g., to file handling and interactive fiction’s riddles). Author
منابع مشابه
A compositional approach to defining logics for coalgebras
We present a compositional approach to defining expressive logics for coalgebras of endofunctors on Set. This approach uses a notion of language constructor and an associated notion of semantics to capture one inductive step in the definition of a language for coalgebras and of its semantics. We show that suitable choices for the language constructors and for their associated semantics yield lo...
متن کاملRelational program logics in decomposed style
Suppose you have developed a Hoare logic for your favorite programming language. You have justified the logic by defining an operational model of the language and constructing a soundness proof that interprets triples as partial correctness assertions. Now you want to interpret program analyses, validate security properties such as noninterference, or justify program transformations. You observ...
متن کاملRn- and Gn-Logics
This paper proposes a simple, set-theoretic framework providing expressive typing, higher-order functions and initial models at the same time. Building upon Russell’s ramified theory of types, we develop the theory of R-logics, which are axiomatisable by an order-sorted equational Horn logic with a membership predicate, and of G-logics, that provide in addition partial functions. The latter are...
متن کاملDynamic sequent calculus for the logic of Epistemic Actions and Knowledge
Dynamic Logics (DLs) form a large family of nonclassical logics, and perhaps the one enjoying the widest range of applications. Indeed, they are designed to formalize change caused by actions of diverse nature: updates on the memory state of a computer, displacements of moving robots in an environment, measurements in models of quantum physics, belief revisions, knowledge updates, etc. In each ...
متن کاملDefining LFIs and LFUs in extensions of infectious logics
The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the {¬,∧,∨}-fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009